Uni cation and Anti-Uni cation in the Calculus of Constructions
نویسنده
چکیده
We present algorithms for uniication and anti-uniication in the Calculus of Constructions, where occurrences of free variables (the variables subject to in-stantiation) are restricted to higher-order patterns, a notion investigated for the simply-typed-calculus by Miller. Most general uniiers and least common anti-instances are shown to exist and are unique up to a simple equivalence. The uniication algorithm is used for logic program execution and type and term reconstruction in the current implementation of Elf and has shown itself to be practical. The main application of the anti-uniication algorithm we have in mind is that of proof generalization.
منابع مشابه
Uni cation of Neural and Fuzzy Computing Paradigms
1 This paper describes a neuro-fuzzy paradigm which uni es several neural and fuzzy paradigms. Similarities and di erences among the various neural and fuzzy paradigms are analyzed and results have been used to derive the proposed uni cation paradigm. A conversion method is also presented to map perceptrons, radial basis networks and fuzzy systems onto each other. It will also be shown that , b...
متن کاملOpacity in the lexicon: a generative lexicon approach to Korean VV compounds
is paper aims at providing a formal description of three types of Korean compounds made up of two verbs (VV compounds) in the Generative Lexicon framework. I will rst discuss several properties commonly ascribed to VV compounds and address the problem of identifying lexical VV compounds as opposed to SVCs and similar constructions. I will then argue that the complex semantic structure and the ...
متن کاملHigher Order Logic Programming with Untyped Lambda Expressions
A higher order logic programming system is presented. The declarative semantics of the system is based on the type-free higher order logic NaDSyL, which takes a nominalist approach to solving the set-theoretic paradoxes. The operational semantics is based on the deterministic and useful subset of higher order uni cation known as pattern uni cation. It is shown that the system allows all express...
متن کاملMatching and Uni cation in Rewrite Theories
\Semantic uni cation" is the process of generating a basis set of substitutions (of terms for variables) that makes two given terms equal in a speci ed theory. Semantic uni cation is an important component of some theorem provers. \Semantic matching," a simpler variant of uni cation, where the substitution is made in only one of the terms, has potential usage in programming language interpreter...
متن کاملPolymorphic Type Inference and Semi-Uni cation
In the last ten years declaration-free programming languages with a polymorphic typing discipline (ML, B) have been developed to approximate the exibility and conciseness of dynamically typed languages (LISP, SETL) while retaining the safety and execution e ciency of conventional statically typed languages (Algol68, Pascal). These polymorphic languages can be type checked at compile time, yet a...
متن کامل